منابع مشابه
MK-fuzzy Automata and MSO Logics
We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizableMK-fuzzy languages accepted by MKfuzzy automat...
متن کاملMK - fuzzy automata ∗
We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in the LogicGuard project [15, 16]. We investigate closure properties of the class of MK-fuzzy languages accepted by MK-fuzzy automata as well as by their deterministic counterp...
متن کاملWeighted Timed MSO Logics
We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate subclasses of weighted timed automata and show how we can extend existing timed MSO logics with weights. Here, we focus on the class of weighted event-recording automata and define a weighted extension of the full logic MSOer(Σ) in...
متن کاملAutomata-based Reasoning in Fuzzy Description Logics
Description logics (DLs) are a family of well-studied knowledge representation formalisms designed to express and reason with the conceptual knowledge of application domains in a clear and well-understood manner. They have been successfully applied for representing large application domains, most prominently from the biological and medical fields. In their classical form, DLs are not adequate f...
متن کاملReasoning in Fuzzy Description Logics using Automata
Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm over the interval [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.256.8